MODIFIED METHOD FOR ELIPTIC CURVE SCALAR POINT MULTIPLICATION OVER GF(P)
نویسندگان
چکیده
منابع مشابه
Novel Method for Elliptic Curve Multi-Scalar Multiplication
The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for fin...
متن کاملA Novel Method for Elliptic Curve Multi-Scalar Multiplication
The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for fin...
متن کاملSpeeding Scalar Multiplication of Elliptic Curve over GF(2mn)
Lee et al. proposed two methods to speed up the computation of scalar multiplication of elliptic curve defined over GF (2) with a medium size of m in the range 10 ≤ m ≤ 20. In these methods, Frobenius map is utilized to expand the integer k and each coefficient of the expansion is represented as a binary string. In this paper, with the application of joint sparse form (JSF) to the coefficients,...
متن کاملAtomicity Improvement for Elliptic Curve Scalar Multiplication
Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of at...
متن کاملElliptic Curve Point Multiplication
New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radio Electronics, Computer Science, Control
سال: 2016
ISSN: 2313-688X,1607-3274
DOI: 10.15588/1607-3274-2016-2-12